Bipartition constrained edge-splitting in directed graphs
نویسندگان
چکیده
منابع مشابه
Constrained Edge-Splitting Problems
Splitting off two edges su, sv in a graph G means deleting su, sv and adding a new edge uv. Let G = (V + s,E) be k-edge-connected in V (k ≥ 2) and let d(s) be even. Lovász proved that the edges incident to s can be split off in pairs in a such a way that the resulting graph on vertex set V is k-edge-connected. In this paper we investigate the existence of such complete splitting sequences when ...
متن کاملA Fast Edge-Splitting Algorithm in Edge-Weighted Graphs
Let H be a graph with a designated vertex s, where edges are weighted by nonnegative reals. Splitting edges e = {u, s} and e′ = {s, v} at s is an operation that reduces the weight of each of e and e′ by a real δ > 0 while increasing the weight of edge {u, v} by δ. It is known that all edges incident to s can be split off while preserving the edge-connectivity of H and that such a complete split...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملEdge-disjoint cycles in regular directed graphs
We prove that any k-regular directed graph with no parallel edges contains a collection of at least Ω(k) edge-disjoint cycles, conjecture that in fact any such graph contains a collection of at least ( k+1 2 ) disjoint cycles, and note that this holds for k ≤ 3. In this paper we consider the maximum size of a collection of edge-disjoint cycles in a directed graph. We pose the following conjectu...
متن کاملIncremental 2-Edge-Connectivity in Directed Graphs
We present an algorithm that can update the 2-edge-connected blocks of a directed graph with n vertices through a sequence of m edge insertions in a total of O(mn) time. After each insertion, we can answer the following queries in asymptotically optimal time: Test in constant time if two query vertices v and w are 2-edge-connected. Moreover, if v and w are not 2-edge-connected, we can produce i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00214-1